1 Warehouse Math
نویسندگان
چکیده
In this chapter I show that elementary math models reveal powerful insights that can help understand better design and management decisions in facility logistics operations. Subsequently I develop models for designing a truckoperated unit-load warehouse (sizing it, calculating the load orientation, and determining the warehouse lengthwidth ratio). Next the optimal stacking depth is calculated and for automated unit-load warehouses the optimum rack size, number of cranes and optimum storage zone boundaries are determined. Finally the impact of the number of inducts on sorting system throughput is determined.
منابع مشابه
Ein mandantenfähiges Data-Warehouse-System für die bayerischen Fachhochschulen - Anforderungen, Konzeption und Realisierung
Seit einigen Jahren befindet sich das deutsche Hochschulwesen im Umbruch, was sich aktuell in der Einführung der leistungsorientierten Mittelverteilung oder der Studienbeiträge zeigt. Der Wandel in Richtung New Public Management führt zu einem erhöhten Bedarf an fundierten Informationen über die eigenen Hochschulprozesse. Zur Unterstützung von Entscheidungen haben sich mittlerweile auch im Hoch...
متن کاملOptimal Transfer-Ordering Strategy for a Deteriorating Inventory in Declining Market
The retailer’s optimal procurement quantity and the number of transfers from the warehouse to the display area are determined when demand is decreasing due to recession and items in inventory are subject to deterioration at a constant rate. The objective is to maximize the retailer’s total profit per unit time. The algorithms are derived to find the optimal strategy by retailer. Numerical examp...
متن کاملApproximating the Joint replenishment Problem with Deadlines
The objective of the classical Joint Replenishment Problem (JRP) is to minimize ordering costs by combining orders in two stages, first at some retailers, and then at a warehouse. These orders are needed to satisfy demands that appear over time at the retailers. We investigate the natural special case that each demand has a deadline until when it needs to be satisfied. For this case, we present...
متن کاملOptimizing over the split closure
The polyhedron defined by all the split cuts obtainable directly (i.e. without iterated cut generation) from the LP-relaxation P of a mixed integer program (MIP) is termed the (elementary, or rank 1) split closure of P . This paper deals with the problem of optimizing over the split closure. This is accomplished by repeatedly solving the following separation problem: given a fractional point, s...
متن کاملThe Stochastic Guaranteed Service Model with Recourse for Multi-Echelon Warehouse Management
The Guaranteed Service Model (GSM) computes optimal order-points in multiechelon inventory control under the assumptions that delivery times can be guaranteed and the demand is bounded. Our new Stochastic Guaranteed Service Model (SGSM) with Recourse covers also scenarios that violate these assumptions. Simulation experiments on real-world data of a large German car manufacturer show that polic...
متن کامل